منابع مشابه
Vote trading and subset sums
We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied vote-swapping parties, the problem is polynomially solvable. For three parties, the problem is NP-complete.
متن کاملSubset Sums
IAl > ((l/k) + E)n then there is a subset B L A such that 0 < 1 BI 0, let snd(nt) denote the smallest integer that does not divide PI. We prove that for every I-: > 0 there is a constant c = ~(8:) z I, such that for every n > 0 and every rn, n ' +' 6 WI < n'llog'n...
متن کاملVote Trading With and Without Party Leaders
Two groups of voters of known sizes disagree over a single binary decision to be taken by simple majority. Individuals have different, privately observed intensities of preferences and before voting can buy or sell votes among themselves for money. We study, theoretically and experimentally, the implication of such trading for outcomes and welfare when trades are coordinated by the two group le...
متن کاملSUBSET SUMS IN Zp
Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?
متن کاملVote Trading in Public Elections (updated version)
During the 2000 U.S. Presidential race an apparently new idea, called vote trading, was introduced to help one of the two major-party candidates (Gore) win. The idea was, through an Internet mechanism, to induce voters who supported a minorparty candidate (Nader) to vote for Gore in states where this would help Gore and to induce an equal number of voters who supported Gore to vote for Nader in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2015
ISSN: 0167-6377
DOI: 10.1016/j.orl.2014.12.007